König ’ s Lemma
نویسنده
چکیده
A contiuation of [5]. The notions of finite-order trees, succesors of an element of a tree, and chains, levels and branches of a tree are introduced. Those notions are used to formalize König’s Lemma which claims that there is a infinite branch of a finite-order tree if the tree has arbitrary long finite chains. Besides, the concept of decorated trees is introduced and some concepts dealing with trees are applied to decorated trees.
منابع مشابه
Graph Grammar Verification through Abstraction
ion Paolo Baldan, Barbara König, and Arend Rensink 1 Dipartimento di Informatica, Università Ca’ Foscari di Venezia
متن کاملOn α-Stable König-Egervary Graphs
The stability number of a graph G, denoted by α(G), is the cardinality of a stable set of maximum size in G. If its stability number remains the same upon the addition of any edge, then G is called α-stable. G is a König-Egervary graph if its order equals α(G) + μ(G), where μ(G) is the cardinality of a maximum matching in G. In this paper we characterize α-stable König-Egervary graphs, generali...
متن کاملR2* response of brain tumors to hyperoxic and hypercapnic respiratory challenges at 3 Tesla
A. Müller, S. Remmele, I. Wenningmann, F. Träber, R. König, H. Clusmann, H. Dahnke, J. Gieseke, S. Flacke, W. A. Willinek, H. H. Schild, and P. Mürtz Department of Radiology, University Hospital Bonn, Bonn, Germany, Philips Research Europe, Hamburg, Germany, Department of Anesthesiology, University Hospital Bonn, Bonn, Germany, Department of Neurosurgery, University Hospital Bonn, Bonn, Germany...
متن کاملSimple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model
We present simple protocols for oblivious transfer and password-based identification which are secure against general attacks in the noisy-quantum-storage model as defined in R. König, S. Wehner, and J. Wullschleger [e-print arXiv:0906.1030]. We argue that a technical tool from König et al. suffices to prove security of the known protocols. Whereas the more involved protocol for oblivious trans...
متن کاملComputable counter-examples to the Brouwer fixed-point theorem
This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and noncomputable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for finding the fixed point in general by giving an example of a computable function which does not fix any computable point. Research in reverse mathematics has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991